Computing with Colored Tangles
نویسندگان
چکیده
We suggest a diagrammatic model of computation based on an axiom of distributivity. A diagram of a decorated colored tangle, similar to those that appear in low dimensional topology, plays the role of a circuit diagram. Equivalent diagrams represent bisimilar computations. We prove that our model of computation is Turing complete and with bounded resources that it can decide any language in complexity class IP, sometimes with better performance parameters than corresponding classical protocols.
منابع مشابه
On the universal sl2 invariant of boundary bottom tangles
The universal sl2 invariant of bottom tangles has a universality property for the colored Jones polynomial of links. Habiro conjectured that the universal sl2 invariant of boundary bottom tangles takes values in certain subalgebras of the completed tensor powers of the quantized enveloping algebra Uh(sl2) of the Lie algebra sl2. In the present paper, we prove an improved version of Habiro’s con...
متن کاملOn the Counting of Colored Tangles
The connection between matrix integrals and links is used to define matrix models which count alternating tangles in which each closed loop is weighted with a factor n, i.e. may be regarded as decorated with n possible colors. For n = 2, the corresponding matrix integral is that recently solved in the study of the random lattice six-vertex model. The generating function of alternating 2-color t...
متن کاملDeterministic Measurement of Reliability and Performance Using Explicit Colored Petri Net in Business Process Execution Language and Eflow
Today there are many techniques for web service compositions. Evaluation of quality parameters has great impact on evaluation of final product. BPEL is one of those techniques that several researches have been done on its evaluation. However, there are few researches on evaluation of QoS in eflow. This research tries to evaluate performance and reliability of eflow and BPEL through mapping them...
متن کاملar X iv : h ep - t h / 93 09 02 9 v 1 6 S ep 1 99 3 Multivariable Invariants of Colored Links Generalizing the Alexander Polynomial ∗
We discuss multivariable invariants of colored links associated with the N dimensional root of unity representation of the quantum group. The invariants for N > 2 are generalizations of the multi-variable Alexander polynomial. The invariants vanish for disconnected links. We review the definition of the invariants through (1,1)-tangles. When (N, 3) = 1 and N is odd, the invariant does not vanis...
متن کاملFrom 3-moves to Lagrangian tangles and cubic skein modules
We present an expanded version of four talks describing recent developments in Knot Theory to which the author contributed. We discuss several open problems in classical Knot Theory and we develop techniques that allow us to study them: Lagrangian tangles, skein modules and Burnside groups. The method of Burnside groups of links was discovered and developed only half a year after the last talk ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Symmetry
دوره 7 شماره
صفحات -
تاریخ انتشار 2015